The Denotational Semantics of Horn Clauses as a Production System
نویسندگان
چکیده
We show how one of Nilsson's tenets on rule-based production systems, when applied to Horn clause programs, leads to a denotational semantics. This formalism, in turn provides a striking illustration of a second Nilsson tenet.
منابع مشابه
Probabilistic Horn Clause Verification
Constrained Horn clauses have proven to be a natural intermediate language for logically characterizing program semantics and reasoning about program behavior. In this paper, we present probabilistically constrained Horn clauses (pchc), which incorporate probabilistic variables inside otherwise traditional constrained Horn clauses. pchc enable reasoning about probabilistic programs by encoding ...
متن کاملExtended Horn Clauses: The Framework and Some Semantics
The purpose of this paper is twofold: to introduce a new extension of concurrent logic programming languages aiming at handling synchronicity and to present and compare several semantics for it. The extended framework essentially rests on an extension of Horn clauses, including multiple atoms in their heads and a guard construct, as well as a new operator between goals. The semantics discussed ...
متن کاملComparative Semantics of Generalized Horn Clauses1
The purpose of this paper is to present and analyze semantically a new extension of concurrent logic programming languages aiming at handling synchronicity. It essentially rests on an extension of Horn clauses, called generalized Horn clauses, and on a new parallel operator between goals. Five semantics are presented and compared. They range in the operational, declarative and denotational type...
متن کاملA Semantics for Concurrent Logic Programming Languages Based on Multiple- Valued Logic
In order to obtain an understanding of parallel logic thought it is necessary to establish a fully abstract model of the denotational semantics of logic programming languages. In this paper, a fixed point semantics for the committed choice, nondeterministic family of parallel programming languages, i.e. the concurrent logic programming languages is developed. The approach is from an order theor...
متن کاملA duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1983